Equivalences among logics of programs
نویسندگان
چکیده
منابع مشابه
Propositional Temporal Logics and Equivalences
We compare propositional temporal logics by comparing the equivalences that they induce on models. Linear time, branching time and partial order temporal logics are considered. The logics are interpreted on occurrence transition systems, generated by labelled prime event structures without auto-concurrency. The induced equivalences are also compared to directly deened equivalences, e.g., histor...
متن کاملModal Logics for Observation Equivalences
In our paper [RM02a] we describe an approach to weak bisimulation for coalgebras and show that parts of the theory of universal coalgebra (with strong bisimulation) can be obtained when considering coalgebras with weak bisimulations and weak homomorphisms. In the present paper we focus on uniformly adapting modal logics that characterise strong bisimulation for coalgebras to several kinds of ob...
متن کاملEquivalences Among Relational Expressions
Many database queries can be formulated in terms of expressions whose operands represent tables of information (relations) and whose operators are the relational operations select, project, and join. This paper studies the equivalence problem for these relational expressions, with expression optimization in mind. A matrix, called a tableau, is proposed as a natural representative for the value ...
متن کاملFinding Equivalences Among Abstract Actions
Separating what is relevant from what is not can turn an intractable learning problem into a solvable one by reducing the complexity of the problem. Abstraction is a good general tool for sorting out relevant and irrelevant information. There are two common types of abstraction: state abstraction, and hierarchical actions. This paper examines the ways in which state abstraction can be used in t...
متن کاملObservational Equivalences for Logic Programs 1
We rst introduce a general semantic scheme for logic programs which provides a uniform framework for deening diierent compositional semantics parametrically wrt a given notion of observable. The equivalence of the operational (top-down) and xpoint (bottom-up) costruction of the semantics is ensured by the scheme (provided a congruence property is veriied). We then deene several observational eq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1984
ISSN: 0022-0000
DOI: 10.1016/0022-0000(84)90027-8